A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems
نویسندگان
چکیده
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph similarity measure based on a multivalent graph matching and which is generic in the sense that other well known graph similarity measures can be viewed as special cases of it. We propose and compare two different kinds of algorithms: an Ant Colony Optimization based algorithm and a Reactive Search. We compare the efficiency of these two algorithms on two different kinds of difficult graph matching problems and we show that they obtain complementary results.
منابع مشابه
Ant Algorithm for the Graph Matching Problem
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-labeled graphs. This new ACO algorithm is experimentally compared with greedy and reactive tabu approaches on subgraph isomorphism problems and on multivalent graph matching problems.
متن کاملAn Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملComparaison de l'optimisation par colonies de fourmis et d'une recherche taboue réactive sur des problèmes d'appariement de graphes
Many applications involve measuring object similarity. When the objects are modeled by graphs, measuring the similarity turn into a graph matching problem, i.e., into the search for a best matching between the graphs vertices. In this paper, we address the problem of computing a graph similarity measure based on a multivalent graph matching. This measure has been shown generic in the sense that...
متن کاملFORCED WATER MAIN DESIGN MIXED ANT COLONY OPTIMIZATION
Most real world engineering design problems, such as cross-country water mains, include combinations of continuous, discrete, and binary value decision variables. Very often, the binary decision variables associate with the presence and/or absence of some nominated alternatives or project’s components. This study extends an existing continuous Ant Colony Optimization (ACO) algorithm to simultan...
متن کاملANT COLONY SEARCH METHOD IN PRACTICAL STRUCTURAL OPTIMIZATION
This paper is concerned with application and evaluation of ant colony optimization (ACO) method to practical structural optimization problems. In particular, a size optimum design of pin-jointed truss structures is considered with ACO such that the members are chosen from ready sections for minimum weight design. The application of the algorithm is demonstrated using two design examples with pr...
متن کامل